On the Complexity of Elementary Modal Logics
نویسندگان
چکیده
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case basis. We prove a very general classification for a wide class of relevant logics: Many important subclasses of modal logics can be obtained by restricting the allowed models with first-order Horn formulas. We show that the satisfiability problem for each of these logics is either NP-complete or PSPACE-hard, and exhibit a simple classification criterion. Further, we prove matching PSPACE upper bounds for many of the PSPACE-hard logics.
منابع مشابه
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers
Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of non-elementary complexity. In this paper, we consider monotone hybrid logics (i.e., the Boolean connectives are conjunction and disjunction only) over N and general li...
متن کاملElementary Modal Logics – Decidability and Complexity
Modal logic was first introduced by philosophers to study the deductive behaviour of the expressions it is necessary that and it is possible that. Nowadays, it is widely used in several areas of computer science, including formal verification and artificial intelligence. Syntactically, modal logic extends propositional logic by two unary operators: ♦ and . The formal semantics is usually given ...
متن کاملProducts, or How to Create Modal Logics of High Complexity
The aim of this paper is to exemplify the complexity of the satisfiability problem of products of modal logics. Our main goal is to arouse interest for the main open problem in this area: a tight complexity bound for the satisfiability problem of the product K×K. At present, only non-elementary decision procedures for this problem are known. Our modest contribution is two-fold. We show that the...
متن کاملThe modal logic of Bayesian belief revision
In Bayesian belief revision a Bayesian agent revises his prior belief by conditionalizing the prior on some evidence using Bayes’ rule. We define a hierarchy of modal logics that capture the logical features of Bayesian belief revision. Elements in the hierarchy are distinguished by the cardinality of the set of elementary propositions on which the agent’s prior is defined. The containment rela...
متن کاملModel checking Branching-Time Properties of Multi-Pushdown Systems is Hard
We address the model checking problem for shared memory concurrent programs modeled as multi-pushdown systems. We consider here boolean programs with a finite number of threads and recursive procedures. It is well-known that the model checking problem is undecidable for this class of programs. In this paper, we investigate the decidability and the complexity of this problem under the assumption...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008